Towards finding global representations of the efficient set in multiple objective mathematical programming

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming

We propose a method for finding the efficient set of a multiple objective linear program based on the well-known facial decomposition of the efficient set. The method incorporates a simple linear programming test that identifies efficient faces while employing a top--down search strategy which avoids enumeration of efficient extreme points and locates the maximally efficient faces of the feasib...

متن کامل

Quality Discrete Representations in Multiple Objective Programming

Within the past ten years, more emphasis has been placed on generating discrete representations of the nondominated set which are truly representative of the nondominated set as a whole. This paper reviews measures for assessing the quality of discrete representations as well as exact solution methods that attempt to produce representations satisfying certain quality criteria. The measures are ...

متن کامل

Interactive multiple objective programming in optimization of the fully fuzzy quadratic programming problems

In this paper, a quadratic programming (FFQP) problem is considered in which all of the cost coefficients, constraints coefficients, and right hand side of the constraints are characterized by L-R fuzzy numbers. Through this paper, the concept of α- level of fuzzy numbers for the objective function, and the order relations on the fuzzy numbers for the constraints are considered.  To optimize th...

متن کامل

Exact generation of epsilon-efficient solutions in multiple objective programming

It is a common characteristic of many multiple objective programming problems that the efficient solution set can only be identified in approximation: since this set often contains an infinite number of points, only a discrete representation can be computed, and due to numerical difficulties, each of these points itself might in general be only approximate to some efficient point. From among th...

متن کامل

ALTERNATIVE MIXED INTEGER PROGRAMMING FOR FINDING EFFICIENT BCC UNIT

Data Envelopment Analysis (DEA) cannot provide adequate discrimination among efficient decision making units (DMUs). To discriminate these efficient DMUs is an interesting research subject. The purpose of this paper is to develop the mix integer linear model which was proposed by Foroughi (Foroughi A.A. A new mixed integer linear model for selecting the best decision making units in data envelo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Naval Research Logistics

سال: 1997

ISSN: 0894-069X,1520-6750

DOI: 10.1002/(sici)1520-6750(199702)44:1<47::aid-nav3>3.0.co;2-m